Improving the Performance of {0,1,3}-NAF Recoding Algorithm for Elliptic Curve Scalar Multiplication
نویسندگان
چکیده
منابع مشابه
Atomicity Improvement for Elliptic Curve Scalar Multiplication
Abstract. In this paper we address the problem of protecting elliptic curve scalar multiplication implementations against side-channel analysis by using the atomicity principle. First of all we reexamine classical assumptions made by scalar multiplication designers and we point out that some of them are not relevant in the context of embedded devices. We then describe the state-of-the-art of at...
متن کاملElliptic Curve Scalar Multiplication Combining Yao's Algorithm and Double Bases
In this paper we propose to take one step back in the use of double base number systems for elliptic curve point scalar multiplication. Using a modified version of Yao’s algorithm, we go back from the popular double base chain representation to a more general double base system. Instead of representing an integer k as Pn i=1 2 i3i where (bi) and (ti) are two decreasing sequences, we only set a ...
متن کاملElliptic-curve scalar multiplication algorithm using ZOT structure
The computation of P over elliptic curves is the dominant operation. It depends on the representation of the scalar . The binary method is the standard unsigned method that is used to compute the elliptic curve point . Researchers found that it is not the most efficient way for implementing elliptic curve computations. Other recoding methods such as CR, NAF, and MOF were presented in order to e...
متن کاملOptimizing {0, 1, 3}-NAF Recoding Algorithm Using Block-Method Technique in Elliptic Curve Cryptosystem
Corresponding Author: Mohsen Bafandehkar Department of Computer Science, University Putra Malaysia, Selangor, Malaysia Email: [email protected] Abstract: The most expensive and time-consuming operation in Elliptic curve cryptosystem is scalar multiplication operation. Optimization of scalar multiplication will substantially enhance the ECC performance. Scalar multiplication can be improved ...
متن کاملFast GPGPU-Based Elliptic Curve Scalar Multiplication
This paper presents a fast implementation to compute the scalar multiplication of elliptic curve points based on a General-Purpose computing on Graphics Processing Units (GPGPU) approach. A GPU implementation using Dan Bernstein's Curve25519, an elliptic curve over a 255-bit prime eld complying with the new 128-bit security level, computes the scalar multiplication in less than a microsecond on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2019
ISSN: 2156-5570,2158-107X
DOI: 10.14569/ijacsa.2019.0100432